The least number of edges for graphs having symmetric automorphism group
نویسندگان
چکیده
منابع مشابه
THE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملSymmetric (36,15,6) Design Having U(3,3) as an Automorphism Group
Up to isomorphism there are four symmetric (36,15,6) designs with automorphisms of order 7. Full automorphism group of one of them is the Chevalley group G(2, 2) ~ U(3,3) : Z2 of order 12096. Unitary group U(3,3) acts transitively on that design.
متن کاملOn the fixing number of graphs with abelian automorphism group
The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group.
متن کاملDistance Transitive Graphs with Symmetric or Alternating Automorphism Group
for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1968
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(68)80046-8